Modified log-Sobolev inequalities and isoperimetry

Modified Log-sobolev Inequalities and Isoperimetry

We find sufficient conditions for a probability measure μ to satisfy an inequality of the type ∫ Rd fF ( f ∫ Rd f 2 dμ ) dμ ≤ C ∫ Rd f2c∗ ( |∇f | |f | ) dμ + B ∫ Rd f dμ, where F is concave and c (a cost function) is convex. We show that under broad assumptions on c and F the above inequality holds if for some δ > 0 and ε > 0 one has ∫ ε 0 Φ ( δc [ tF ( 1t ) Iμ(t) ]) dt <∞, where Iμ is the isop...

Log-sobolev, Isoperimetry and Transport Inequalities on Graphs

In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...

Isoperimetry and Symmetrization for Logarithmic Sobolev Inequalities

Using isoperimetry and symmetrization we provide a unified framework to study the classical and logarithmic Sobolev inequalities. In particular, we obtain new Gaussian symmetrization inequalities and connect them with logarithmic Sobolev inequalities. Our methods are very general and can be easily adapted to more general contexts.

Logarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs

In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.

Modified logarithmic Sobolev inequalities and transportation inequalities